Happy Ending problem

For the Fred Frith album, see The Happy End Problem.

The Happy Ending problem (so named by Paul Erdős because it led to the marriage of George Szekeres and Esther Klein) is the following statement:

Theorem. Any set of five points in the plane in general position[1] has a subset of four points that form the vertices of a convex quadrilateral.

This was one of the original results that led to the development of Ramsey theory.

The Happy Ending theorem can be proven by a simple case analysis: If four or more points are vertices of the convex hull, any four such points can be chosen. If on the other hand the point set has the form of a triangle with two points inside it, the two inner points and one of the triangle sides can be chosen. See Peterson (2000) for an illustrated explanation of this proof, and Morris & Soltan (2000) for a more detailed survey of the problem than we provide here.

The Erdős–Szekeres conjecture states precisely a more general relationship between the number of points in a general-position point set and its largest convex polygon. It remains unproven, but less precise bounds are known.

Contents

Larger polygons

Erdős & Szekeres (1935) proved the following generalisation:

Theorem. For any positive integer N, any sufficiently large finite set of points in the plane in general position has a subset of N points that form the vertices of a convex polygon.

The proof appeared in the same paper that proves the Erdős–Szekeres theorem on monotonic subsequences in sequences of numbers.

Denoting by f(N) the minimal possible M for a set of M points in general position must contain a convex N-gon, it is known that

On the basis of the known values of f(N) for N = 3, 4 and 5, Erdős and Szekeres conjectured in their original paper that

f(N) = 1 %2B 2^{N-2} \quad \mbox{for all } N \geq 3.

They proved later, by constructing explicit examples, that

f(N) \geq 1 %2B 2^{N-2},[5]

but the best known upper bound when N ≥ 7 is

f(N) \leq {2N-5 \choose N-2} %2B 1 = O\left(\frac{4^N}{\sqrt N}\right).[6]

Empty polygons

One may also consider the question of whether any sufficiently large set of points in general position has an empty quadrilateral, pentagon, etc., that is, one that contains no other input point. The original solution to the Happy Ending problem can be adapted to show that any five points in general position have an empty convex quadrilateral, as shown in the illustration, and any ten points in general position have an empty convex pentagon.[7] However, there exist arbitrarily large sets of points in general position that contain no empty heptagon.[8]

For a long time the question of the existence of empty hexagons remained open, but Nicolás (2007) and Gerken (2008) proved that every sufficiently large point set in general position contains a convex empty hexagon. More specifically, Gerken showed that the number of points needed is no more than f(9) for the same function f defined above, while Nicolás showed that the number of points needed is no more than f(25). Valtr (2006) supplies a simplification of Gerken's proof that however requires more points, f(15) instead of f(9). At least 30 points are needed: there exists a set of 29 points in general position with no empty convex hexagon.[9]

Related problems

The problem of finding sets of n points minimizing the number of convex quadrilaterals is equivalent to minimizing the crossing number in a straight-line drawing of a complete graph. The number of quadrilaterals must be proportional to the fourth power of n, but the precise constant is not known.[10]

It is straightforward to show that, in higher dimensional Euclidean spaces, sufficiently large sets of points will have a subset of k points that forms the vertices of a convex polytope, for any k greater than the dimension: this follows immediately from existence of convex k-gons in sufficiently large planar point sets, by projecting the higher dimensional point set into an arbitrary two-dimensional subspace. However, the number of points necessary to find k points in convex position may be smaller in higher dimensions than it is in the plane, and it is possible to find subsets that are more highly constrained. In particular, in d dimensions, every d + 3 points in general position have a subset of d + 2 points that form the vertices of a cyclic polytope.[11] More generally, for every d and k > d there exists a number m(d,k) such that every set of m(d,k) points in general position has a subset of k points that form the vertices of a neighborly polytope.[12]

Notes

  1. ^ In this context, general position means that no two points coincide and no three points are collinear.
  2. ^ This was the original problem, proved by Esther Klein.
  3. ^ According to Erdős & Szekeres (1935), this was first proved by E. Makai; the first published proof appeared in Kalbfleisch, Kalbfleisch & Stanton (1970).
  4. ^ This has been proved by Szekeres & Peters (2006). They carried out a computer search which eliminated all possible configurations of 17 points without convex hexagons while examining only a tiny fraction of all configurations.
  5. ^ Erdős & Szekeres (1961)
  6. ^ Tóth & Valtr (2005). See binomial coefficient and Big O notation for notation used here and Catalan numbers or Stirling's approximation for the asymptotic expansion.
  7. ^ Harborth (1978).
  8. ^ Horton (1983)
  9. ^ Overmars (2003).
  10. ^ Scheinerman & Wilf (1994)
  11. ^ Grünbaum (2003), Ex. 6.5.6, p.120. Grünbaum attributes this result to a private communication of Micha A. Perles.
  12. ^ Grünbaum (2003), Ex. 7.3.6, p. 126. This result follows by applying a Ramsey-theoretic argument similar to Szekeres' original proof together with Perles' result on the case k = d + 2.

References

External links